Memory Event Clocks
نویسندگان
چکیده
We introduce logics and automata based on memory event clocks. A memory clock is not really reset: instead, a new clock is created, while the old one is still accessible by indexing. We can thus constrain not only the time since the last reset (which was the main limitation in event clocks), but also since previous resets. When we introduce these clocks in the linear temporal logic of the reals, we create Recursive Memory Event Clocks Temporal Logic (RMECTL). It turns out to have the same expressiveness as the Temporal Logic with Counting (TLC) of Hirshfeld and Rabinovich. We then examine automata with recursive memory event clocks (RMECA). Recursive event clocks are reset by simpler RMECA, hence the name “recursive”. In contrast, we show that for RMECA, memory clocks do not add expressiveness, but only concision. The original RECA define thus a fully decidable, robust and expressive level of real-time expressiveness.
منابع مشابه
O14: Autobiographical Memory, Trauma, and the Development of Memory Interventions
Autobiographical memory, that is, our memory for personal life experiences, is integral to our sense of self. However, the experience of trauma can create distortions in how our memories are bought to mind. In particular, trauma can produce an overgeneral memory style, which relates to the development of both PTSD and depression. However, theory states that immediately following a traumatic eve...
متن کاملPlatform-related Limitations to Efficiency in Standard Clock Simulation on Sequential Machines
Standard Clock (SC) simulation is an efficient form of discreteevent simulation that is applicable to systems with exponential interevent times. It achieves its efficiency by using a common event stream to construct, on sequential or parallel machines, many sample paths in parallel. However, on sequential machines the efficiency is limited by two factors: (1) A fundamental simulation method-rel...
متن کاملEfficient Vector Time with Dynamic Process Creation and Termination
Many distributed algorithms require knowledge of the causal relationships between events. Examples include optimistic recovery protocols, distributed debugging systems, and causal distributed shared memory. Determining causal relationships can be difficult, however, because there is no global clock and local clocks cannot be perfectly synchronized. Vector time is a useful abstraction for captur...
متن کاملThesis for the degree of Doctor of Philosophy Algorithms for synchronization and consistency in concurrent system services
Synchronization, consistency and scalability are important issues in the design of concurrent computer system services. In this thesis we study the application of optimistic and scalable methods in concurrent system services. In a distributed setting we study scalable tracking of the causal relations between events, lightweight information dissemination in optimistic causal order in distributed...
متن کاملRelativity Theory and Time Perception: Single or Multiple Clocks?
BACKGROUND Current theories of interval timing assume that humans and other animals time as if using a single, absolute stopwatch that can be stopped or reset on command. Here we evaluate the alternative view that psychological time is represented by multiple clocks, and that these clocks create separate temporal contexts by which duration is judged in a relative manner. Two predictions of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010